Extremal Energy of Digraphs with Two Linear Subdigraphs
نویسندگان
چکیده
The eigenvalues of a digraph are the eigenvalues of its adjacency matrix. The sum of the absolute values of the real part of the eigenvalues is called the energy of the digraph. The extremal energy of bicyclic digraphs with vertex-disjoint directed cycles is known. In this paper, we consider a class of bicyclic digraphs with exactly two linear subdigraphs of equal length. We find the minimal and maximal energy among the digraphs in this class.
منابع مشابه
Monomial Subdigraphs of Reachable and Controllable Positive Discrete–time Systems
A generic structure of reachable and controllable positive linear systems is given in terms of some characteristic components (monomial subdigraphs) of the digraph of a non-negative a pair. The properties of monomial subdigraphs are examined and used to derive reachability and controllability criteria in a digraph form for the general case when the system matrix A may contain zero columns. The ...
متن کاملMore skew-equienergetic digraphs
Two digraphs of same order are said to be skew-equienergetic if their skew energies are equal. One of the open problems proposed by Li and Lian was to construct non-cospectral skew-equienergetic digraphs on n vertices. Recently this problem was solved by Ramane et al. In this paper, we give some new methods to construct new skew-equienergetic digraphs.
متن کاملPushing vertices in digraphs without long induced cycles
Given a digraph D and a subset X of vertices of D, pushing X in D means reversing the orientation of all arcs with exactly one end in X. It is known that the problem of deciding whether a given digraph can be made acyclic using the push operation is NP-complete for general digraphs, and polynomial time solvable for multipartite tournaments. Here, we continue the study of deciding whether a digr...
متن کاملThe Diameter of Cyclic Kautz Digraphs
A prominent problem in Graph Theory is to find extremal graphs or digraphs with restrictions in their diameter, degree and number of vertices. Here we obtain a new family of digraphs with minimal diameter, that is, given the number of vertices and degree there is no other digraph with a smaller diameter. This new family is called modified cyclic digraphsMCK(d, ) and it is derived from the Kautz...
متن کاملOn the Energy of Bicyclic Signed Digraphs
Among unicyclic digraphs and signed digraphs with fixed number of vertices, the digraphs and signed digraphs with minimal and maximal energy are already determined. In this paper we address the problem of finding bicyclic signed digraphs with extremal energy. We obtain minimal and maximal energy among all those n -vertex bicyclic signed digraphs which contain vertex-disjoint signed directed cyc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016